|
A weak heap is a variation of the a binary heap data structure. ==Description== A weak max-heap on a set of ''n'' values is defined to be a binary tree with ''n'' nodes, one for each value, satisfying the following constraints: *The root node has no left child *For every node, the value associated with that node is greater or equal to than the values associated with all nodes in its right subtree. *The leaves of the tree have heights that are all within one of each other. A weak min-heap is similar, but reverses the required order relationship between the value at each node and in its right subtree. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Weak heap」の詳細全文を読む スポンサード リンク
|